Distributed Queuing in Dynamic Networks
نویسندگان
چکیده
منابع مشابه
Distributed Queuing in Dynamic Networks
We consider the problem of forming a distributed queue in the adversarial dynamic network model of Kuhn, Lynch, and Oshman (STOC 2010) in which the network topology changes from round to round but the network stays connected. This is a synchronous model in which network nodes are assumed to be fixed, the communication links for each round are chosen by an adversary, and nodes do not know who th...
متن کاملDistributed Queuing-based Random Access Procedure in Mobile Networks
Random access procedure is an access mechanism to radio resources in Long Term Evolution (LTE) mobile networks to handle a competition for radio resources of Machine Type Communication (MTC) devices. In the random access procedure, the MTC devices transmit a request for radio resources in the first available opportunity. The devices which select the same resource fail the access and need to com...
متن کاملLong Term Behavior of Dynamic Equilibria in Fluid Queuing Networks
A fluid queuing network constitutes one of the simplest models in which to study flow dynamics over a network. In this model we have a single source-sink pair and each link has a per-time-unit capacity and a transit time. A dynamic equilibrium (or equilibrium flow over time) is a flow pattern over time such that no flow particle has incentives to unilaterally change its path. Although the model...
متن کاملEfficient Distributed Queuing System Simulation
Queuing systems are an important building block for performance evaluation in various application areas, due to their powerful, yet simple nature. Although it is often possible to perform an analytical evaluation of a queuing model, simulation of queuing systems remains an important technique in the context of performance evaluation. In order to speed up queuing simulation executions, parallel ...
متن کاملLocal Distributed Algorithms in Highly Dynamic Networks
The present paper studies local distributed graph problems in highly dynamic networks. We define a (in our view) natural generalization of static graph problems to the dynamic graph setting. For some parameter T > 0, the set of admissible outputs of nodes in a T -dynamic solution for a given graph problem at some time t is defined by the dynamic graph topology in the time interval [t − T, t]. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Processing Letters
سال: 2015
ISSN: 0129-6264,1793-642X
DOI: 10.1142/s012962641550005x